منابع مشابه
A clausal resolution method for CTL branching-time temporal logic
In this paper we extend our clausal resolution method for linear time temporal logics to a branching-time framework. Thus, we propose an e cient deductive method useful in a variety of applications requiring an expressive branching-time temporal logic in AI. The branching-time temporal logic considered is Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class. T...
متن کاملClausal Resolution for CTL*
In this paper we consider proof techniques for branching-time temporal logics. While a considerable amount of research has been carried out regarding the relationship between finite automata and such logics, practical proof techniques for such logics have received relatively little attention. Recently, however, several applications requiring refined proof methods for branching-time temporal log...
متن کاملA Combination of Clausal and Non Clausal Temporal Logic Programs
We have developped Tokio interpreter[5] for rst order Inteval Temporal Logic[11] and an automatic theorem prover [6, 7] for Propositional Interval Temporal Logic. The veri er features deterministic tableau expansion and binary decision tree representation of subterms. Combining these, we can avoid repeated similar clausal form time constraints, and it is possible to execute wider range of speci...
متن کاملExploring the Monodic Fragment of First-Order Temporal Logic using Clausal Temporal Resolution
Until recently, first-order temporal logic has been little understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not available. However, a breakthrough by Hodkinson et.al., identifying a finitely axiomatisable fragment, termed the monodic fragment, has led to improved understanding of first-order temporal logi...
متن کاملClausal Resolution for Modal Logics of Confluence
We present a clausal resolution-based method for normal multimodal logics of confluence, whose Kripke semantics are based on frames characterised by appropriate instances of the Church-Rosser property. Here we restrict attention to eight families of such logics. We show how the inference rules related to the normal logics of confluence can be systematically obtained from the parametrised axioms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2001
ISSN: 1529-3785,1557-945X
DOI: 10.1145/371282.371311